Forking in the free group

نویسنده

  • Anand Pillay
چکیده

We study model-theoretic and stability-theoretic properties of the nonabelian free group in the light of Sela’s recent result [15] on stability and results announced by Bestvina and Feighn on “negligible subsets” of free groups. We point out analogies between the free group and socalled bad groups of finite Morley rank, and prove “non CM -triviality” of the free group.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

F eb 2 00 7 Forking in the free group

We study model-theoretic and stability-theoretic properties of the nonabelian free group in the light of Sela’s recent result [15] on stability and results announced by Bestvina and Feighn on “negligible subsets” of free groups. We point out analogies between the free group and socalled bad groups of finite Morley rank, and prove “non CM -triviality”

متن کامل

Forking in the category of existentially closed structures

If T is a (first order) universal theory then we can consider the category of existentially closed models of T with embeddings as morphisms. This class of structures is in general not the class of models of a first order theory T ′. (It will be, just if T has a model companion T ′.) The “model theory” of such a “non-elementary class” was a substantial line of research in the 1970’s, mainly amon...

متن کامل

A Comprehensive Study of Software Forks: Dates, Reasons and Outcomes

In general it is assumed that a software product evolves within the authoring company or group of developers that develop the project. However, in some cases different groups of developers make the software evolve in different directions, a situation which is commonly known as a fork. In the case of free software, although forking is a practice that is considered as a last resort, it is inheren...

متن کامل

Saturated free algebras revisited

We give an exposition of results of Baldwin-Shelah [2] on saturated free algebras, at the level of generality of complete first order theories T with a saturated model M which is in the algebraic closure of an indiscernible set. We then make some new observations when M is a saturated free algebra, analogous to (more difficult) results for the free group, such as a description of forking.

متن کامل

Forking and Dividing in Henson Graphs

For n ≥ 3, define Tn to be the theory of the generic Kn-free graph, where Kn is the complete graph on n vertices. We prove a graph theoretic characterization of dividing in Tn, and use it to show that forking and dividing are the same for complete types. We then give an example of a forking and nondividing formula. Altogether, Tn provides a counterexample to a recent question of Chernikov and K...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007